\hypertarget{class_priority_queue}{
\section{PriorityQueue$<$ T $>$ Class Template Reference}
\label{class_priority_queue}\index{PriorityQueue@{PriorityQueue}}
}


{\ttfamily \#include $<$priority\_\-queue.h$>$}

\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{class_priority_queue_a26657301dcdb58a2b98c52868f4eff85}{PriorityQueue} (int priorityCount)
\begin{DoxyCompactList}\small\item\em Constructor. \item\end{DoxyCompactList}\item 
\hyperlink{class_priority_queue_a69038745381e57fe65b3a5da985a5506}{$\sim$PriorityQueue} ()
\begin{DoxyCompactList}\small\item\em Destructor. \item\end{DoxyCompactList}\item 
void \hyperlink{class_priority_queue_a88c0b212c85e6e500d6213a6ee0b6463}{push} (T item, int priority)
\begin{DoxyCompactList}\small\item\em Add item to the queue. \item\end{DoxyCompactList}\item 
T \hyperlink{class_priority_queue_a38deb7818722ba5bdf328541c0f669e8}{pop} ()
\begin{DoxyCompactList}\small\item\em Return the first item in FIFO queue and remove this item. \item\end{DoxyCompactList}\item 
bool \hyperlink{class_priority_queue_a495abe086dd248059e4325cdf08e1bb1}{empty} () const 
\begin{DoxyCompactList}\small\item\em Is the queue empty ? \item\end{DoxyCompactList}\item 
int \hyperlink{class_priority_queue_a78870582a8eeb9ec8fe33e9fe72780de}{size} () const 
\begin{DoxyCompactList}\small\item\em Number of items in the queue. \item\end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename T$>$ class PriorityQueue$<$ T $>$}

\begin{DoxyAuthor}{Author}
Vojta 
\end{DoxyAuthor}
\begin{DoxyDate}{Date}
04/01/10 
\end{DoxyDate}


\subsection{Constructor \& Destructor Documentation}
\hypertarget{class_priority_queue_a26657301dcdb58a2b98c52868f4eff85}{
\index{PriorityQueue@{PriorityQueue}!PriorityQueue@{PriorityQueue}}
\index{PriorityQueue@{PriorityQueue}!PriorityQueue@{PriorityQueue}}
\subsubsection[{PriorityQueue}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ template IntPriQueue::PriorityQueue (int {\em priorityCount})\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a26657301dcdb58a2b98c52868f4eff85}


Constructor. 


\begin{DoxyParams}{Parameters}
\item[{\em Number}]of allowed \end{DoxyParams}
\hypertarget{class_priority_queue_a69038745381e57fe65b3a5da985a5506}{
\index{PriorityQueue@{PriorityQueue}!$\sim$PriorityQueue@{$\sim$PriorityQueue}}
\index{$\sim$PriorityQueue@{$\sim$PriorityQueue}!PriorityQueue@{PriorityQueue}}
\subsubsection[{$\sim$PriorityQueue}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ template IntPriQueue::$\sim$PriorityQueue ()\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a69038745381e57fe65b3a5da985a5506}


Destructor. 



\subsection{Member Function Documentation}
\hypertarget{class_priority_queue_a495abe086dd248059e4325cdf08e1bb1}{
\index{PriorityQueue@{PriorityQueue}!empty@{empty}}
\index{empty@{empty}!PriorityQueue@{PriorityQueue}}
\subsubsection[{empty}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ template bool IntPriQueue::empty () const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a495abe086dd248059e4325cdf08e1bb1}


Is the queue empty ? 

\begin{DoxyReturn}{Returns}
True if the queue is empty, False otherwise 
\end{DoxyReturn}
\hypertarget{class_priority_queue_a38deb7818722ba5bdf328541c0f669e8}{
\index{PriorityQueue@{PriorityQueue}!pop@{pop}}
\index{pop@{pop}!PriorityQueue@{PriorityQueue}}
\subsubsection[{pop}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ template int IntPriQueue::pop ()\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a38deb7818722ba5bdf328541c0f669e8}


Return the first item in FIFO queue and remove this item. 

\begin{DoxyReturn}{Returns}
Item 
\end{DoxyReturn}
\hypertarget{class_priority_queue_a88c0b212c85e6e500d6213a6ee0b6463}{
\index{PriorityQueue@{PriorityQueue}!push@{push}}
\index{push@{push}!PriorityQueue@{PriorityQueue}}
\subsubsection[{push}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ void {\bf PriorityQueue}$<$ T $>$::push (T {\em item}, \/  int {\em priority})\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a88c0b212c85e6e500d6213a6ee0b6463}


Add item to the queue. 


\begin{DoxyParams}{Parameters}
\item[{\em Item}]\item[{\em Priority}]of the item \end{DoxyParams}
\hypertarget{class_priority_queue_a78870582a8eeb9ec8fe33e9fe72780de}{
\index{PriorityQueue@{PriorityQueue}!size@{size}}
\index{size@{size}!PriorityQueue@{PriorityQueue}}
\subsubsection[{size}]{\setlength{\rightskip}{0pt plus 5cm}template$<$typename T $>$ template int IntPriQueue::size () const\hspace{0.3cm}{\ttfamily  \mbox{[}inline\mbox{]}}}}
\label{class_priority_queue_a78870582a8eeb9ec8fe33e9fe72780de}


Number of items in the queue. 

\begin{DoxyReturn}{Returns}
Number of items in the queue 
\end{DoxyReturn}


The documentation for this class was generated from the following files:\begin{DoxyCompactItemize}
\item 
src/\hyperlink{priority__queue_8h}{priority\_\-queue.h}\item 
src/\hyperlink{priority__queue_8cpp}{priority\_\-queue.cpp}\end{DoxyCompactItemize}
